An exclusion region for minimum dilation triangulations

نویسندگان

  • Christian Knauer
  • Wolfgang Mulzer
چکیده

Given a planar graph G, the graph theoretic dilation of G is defined as the maximum ratio of the shortestpath distance and the Euclidean distance between any two vertices of G. Given a planar point set S, a triangulation of S that achieves minimum graph theoretic dilation is called a minimum dilation triangulation of S. In this paper, we show that a simple exclusion region for an edge e of the minimum dilation triangulation is given by the disk of radius α|e| centered at the midpoint of e, where α is any constant < 3 cos(π/6)/(4π) ≈ 0.2067.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On exclusion regions for optimal triangulations

An exclusion region for a triangulation is a region that can be placed around each edge of the triangulation such that the region can not contain points from the set on both sides of the edge. We survey known exclusion regions for several classes of triangulations, including Delaunay, Greedy, and Minimum Weight triangulations. We then show an exclusion region of larger area than was previously ...

متن کامل

Minimum Dilation Triangulations

Given a planar graph G, the graph theoretic dilation of G is defined as the maximum ratio of the shortest-path distance and the Euclidean distance between any two vertices of G. Given a planar point set S, the graph theoretic dilation of S is the minimum graph theoretic dilation that any triangulation of S can achieve. We study the graph theoretic dilation of the regular n-gon. In particular, w...

متن کامل

Computational Aspects of Triangulations with Bounded Dilation

Let T be a triangulation on a planar point set S. If T has bounded dilation, then the shortest path distance between any two vertices approximates their Euclidean distance. We examine if such triangulations can be used to design efficient algorithms for various geometric problems. First, we show that given a triangulation with bounded dilation, one can find the closest pair of points in S in li...

متن کامل

Approximated algorithms for the minimum dilation triangulation problem

The complexity status of the Minimum Dilation Triangulation (MDT) problem for a general point set is unknown. Therefore, we focus on the development of approximated algorithms to find high quality triangulations of minimum dilation. For an initial approach, we design a greedy strategy able to obtain approximate solutions to the optimal ones in a simple way. We also propose an operator to genera...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005